Geometric Sparsity in High Dimension
نویسندگان
چکیده
منابع مشابه
A NOVEL FUZZY-BASED SIMILARITY MEASURE FOR COLLABORATIVE FILTERING TO ALLEVIATE THE SPARSITY PROBLEM
Memory-based collaborative filtering is the most popular approach to build recommender systems. Despite its success in many applications, it still suffers from several major limitations, including data sparsity. Sparse data affect the quality of the user similarity measurement and consequently the quality of the recommender system. In this paper, we propose a novel user similarity measure based...
متن کاملA Sharp Sufficient Condition for Sparsity Pattern Recovery
Sufficient number of linear and noisy measurements for exact and approximate sparsity pattern/support set recovery in the high dimensional setting is derived. Although this problem as been addressed in the recent literature, there is still considerable gaps between those results and the exact limits of the perfect support set recovery. To reduce this gap, in this paper, the sufficient con...
متن کاملSub-linear Upper Bounds on Fourier dimension of Boolean Functions in terms of Fourier sparsity
We prove that the Fourier dimension of any Boolean function with Fourier sparsity s is at most O ( s ) . Our proof method yields an improved bound of Õ( √ s) assuming a conjecture of Tsang et. al. [TWXZ13], that for every Boolean function of sparsity s there is an affine subspace of F2 of co-dimension O(poly log s) restricted to which the function is constant. This conjectured bound is tight up...
متن کاملNear-Optimal Upper Bound on Fourier Dimension of Boolean Functions in Terms of Fourier Sparsity
We prove that the Fourier dimension of any Boolean function with Fourier sparsity s is at most O ( √ s log s). This bound is tight upto a factor of log s as the Fourier dimension and sparsity of the address function are quadratically related. We obtain the bound by observing that the Fourier dimension of a Boolean function is equivalent to its non-adaptive parity decision tree complexity, and t...
متن کاملSpeech Enhancement using Adaptive Data-Based Dictionary Learning
In this paper, a speech enhancement method based on sparse representation of data frames has been presented. Speech enhancement is one of the most applicable areas in different signal processing fields. The objective of a speech enhancement system is improvement of either intelligibility or quality of the speech signals. This process is carried out using the speech signal processing techniques ...
متن کامل